Energy Dissipation Via Coupling With a Finite Chaotic Environment

We study the flow of energy between a harmonic oscillator (HO) and an external environment consisting of N two-degrees of freedom non-linear oscillators, ranging from integrable to chaotic according to a control parameter. The coupling between the HO and the environment is bilinear in the coordinates and scales with system size with the inverse square root of N. We study the conditions for energy dissipation and thermalization as a function of N and of the dynamical regime of the non-linear oscillators. The study is classical and based on single realization of the dynamics, as opposed to ensemble averages over many realizations. We find that dissipation occurs in the chaotic regime for a fairly small N, leading to the thermalization of the HO and environment a Boltzmann distribution of energies for a well defined temperature. We develop a simple analytical treatment, based on the linear response theory, that justifies the coupling scaling and reproduces the numerical simulations when the environment is in the chaotic regime.Comment: 7 pages, 10 figure

Vulnerability and Protection of Critical Infrastructures

Critical infrastructure networks are a key ingredient of modern society. We discuss a general method to spot the critical components of a critical infrastructure network, i.e. the nodes and the links fundamental to the perfect functioning of the network. Such nodes, and not the most connected ones, are the targets to protect from terrorist attacks. The method, used as an improvement analysis, can also help to better shape a planned expansion of the network.Comment: 4 pages, 1 figure, 3 table

Energy transfer dynamics and thermalization of two oscillators interacting via chaos

We consider the classical dynamics of two particles moving in harmonic potential wells and interacting with the same external environment (HE), consisting of N non-interacting chaotic systems. The parameters are set so that when either particle is separately placed in contact with the environment, a dissipative behavior is observed. When both particles are simultaneously in contact with HE an indirect coupling between them is observed only if the particles are in near resonance. We study the equilibrium properties of the system considering ensemble averages for the case N=1 and single trajectory dynamics for N large. In both cases, the particles and the environment reach an equilibrium configuration at long times, but only for large N a temperature can be assigned to the system.Comment: 8 pages, 6 figure

Spectral-spatial classification of hyperspectral images: three tricks and a new supervised learning setting

Spectral-spatial classification of hyperspectral images has been the subject of many studies in recent years. In the presence of only very few labeled pixels, this task becomes challenging. In this paper we address the following two research questions: 1) Can a simple neural network with just a single hidden layer achieve state of the art performance in the presence of few labeled pixels? 2) How is the performance of hyperspectral image classification methods affected when using disjoint train and test sets? We give a positive answer to the first question by using three tricks within a very basic shallow Convolutional Neural Network (CNN) architecture: a tailored loss function, and smooth- and label-based data augmentation. The tailored loss function enforces that neighborhood wavelengths have similar contributions to the features generated during training. A new label-based technique here proposed favors selection of pixels in smaller classes, which is beneficial in the presence of very few labeled pixels and skewed class distributions. To address the second question, we introduce a new sampling procedure to generate disjoint train and test set. Then the train set is used to obtain the CNN model, which is then applied to pixels in the test set to estimate their labels. We assess the efficacy of the simple neural network method on five publicly available hyperspectral images. On these images our method significantly outperforms considered baselines. Notably, with just 1% of labeled pixels per class, on these datasets our method achieves an accuracy that goes from 86.42% (challenging dataset) to 99.52% (easy dataset). Furthermore we show that the simple neural network method improves over other baselines in the new challenging supervised setting. Our analysis substantiates the highly beneficial effect of using the entire image (so train and test data) for constructing a model.Comment: Remote Sensing 201

Strategies of success for social networks: Mermaids and temporal evolution

The main goal of this article is to investigate techniques that can quickly lead to successful social systems by boosting network connectivity. This is especially useful when starting new online communities where the aim is to increase the system utilization as much as possible. This aspect is very important nowadays, given the existence of many online social networks available on the web, and the relatively high level of competition. In other words, attracting users' attention is becoming a major concern, and time is an essential factor when investing money and resources into online social systems. Our study describes an effective technique that deals with this issue by introducing the notion of mermaids, special attractors that alter the normal evolutive behavior of a social system. We analyze how mermaids can boost social networks, and then provide estimations of fundamental parameters that business strategists can take into account in order to obtain successful systems within a constrained budget

Energy Dissipation Via Coupling With A Finite Chaotic Environment.

We study the flow of energy between a harmonic oscillator (HO) and an external environment consisting of N two-degrees-of-freedom nonlinear oscillators, ranging from integrable to chaotic according to a control parameter. The coupling between the HO and the environment is bilinear in the coordinates and scales with system size as 1/√N. We study the conditions for energy dissipation and thermalization as a function of N and of the dynamical regime of the nonlinear oscillators. The study is classical and based on a single realization of the dynamics, as opposed to ensemble averages over many realizations. We find that dissipation occurs in the chaotic regime for fairly small values of N, leading to the thermalization of the HO and the environment in a Boltzmann distribution of energies for a well-defined temperature. We develop a simple analytical treatment, based on the linear response theory, that justifies the coupling scaling and reproduces the numerical simulations when the environment is in the chaotic regime.8306111

Proving termination of logic programs with delay declarations

In this paper we propose a method for proving termination of logic programs with delay declarations. The method is based on the notion of recurrent logic program, which is used to prove programs terminating wrt an arbitrary selection rule. Most importantly, we use the notion of bound query (as proposed by M. Bezem) in the definition of cover, a new notion which forms the kernel of our approach. We introduce the class of delay recurrent programs and prove that programs in this class terminate for all local delay selection rules, provided that the delay conditions imply boundedness. The corresponding method can be also used to transform a logic program into a terminating logic program with delay declarations

Proving deadlock freedom of logic programs with dynamic scheduling

In increasingly many logic programming systems, the Prolog left to right selection rule has been replaced with dynamic selection rules, that select an atom of a query among those satisfying suitable conditions. These conditions describe the form of the arguments of every program predicate, by means of a so-called delay declaration. Dynamic selection rules introduce the possibility of deadlock, an abnormal form of termination that occurs if the query is non-empty and it contains no `selectable' atoms. In this paper, we introduce a simple compositional assertional method for proving deadlock freedom. The method is based on the notion of suspension cover, a static description of the possible dynamic schedulings of the body atoms of a clause, according to a given delay declaration. In the method, we assume that monotonic assertions are used for specifying the conditions of the delay declaration. Apart sections are devoted to two more practical instances of the method, that use types and modes, respectively